منابع مشابه
Function spaces with dominating mixed smoothness
Acknowledgements I would like to express my deepest appreciation to my supervisors Professor Hans-Jürgen Schmeisser and Professor Winfried Sickel for their support and many hints and comments. I thank also Professor Hans Triebel for many valuable discussions on the topic of this work.
متن کاملMixed Matrices — Irreducibility and Decomposition — ∗
This paper surveys mathematical properties of (layered-) mixed matrices with emphasis on irreducibility and block-triangular decomposition. A matrix A is a mixed matrix if A = Q + T , where Q is a “constant” matrix and T is a “generic” matrix (or formal incidence matrix) in the sense that the nonzero entries of T are algebraically independent parameters. A layered mixed (or LM-) matrix is a mix...
متن کاملThe mixed dominating set problem is MAX SNP-hard
Given a graph G = (V,E), a mixed dominating set MD of G is defined to be a subset of V ∪ E such that every element in {(V ∪E)\MD} is either adjacent or incident to an element of MD. The mixed dominating set problem is to find a mixed dominating set with minimum cardinality. This problem is NP-hard. In this paper, we prove that this problem is MAX SNP-hard.
متن کاملOn the Degree of Mixed Polynomial Matrices
The mixed polynomial matrix, introduced as a convenient mathematical tool for the description of physical/engineering dynamical systems, is a polynomial matrix of which the coefficients are classified into fixed constants and independent parameters. The valuated matroid, invented by Dress and Wenzel [Appl. Math. Lett., 3 (1990), pp. 33–35], is a combinatorial abstraction of the degree of minors...
متن کاملMatroid Matching Via Mixed Skew-Symmetric Matrices
Tutte associates a V by V skew-symmetric matrix T , having indeterminate entries, with a graph G=(V,E). This matrix, called the Tutte matrix, has rank exactly twice the size of a maximum cardinality matching of G. Thus, to find the size of a maximum matching it suffices to compute the rank of T . We consider the more general problem of computing the rank of T +K where K is a real V by V skew-sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1998
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(97)00239-5